Summary
Simplicial sets generalise many categories of graphs. In this paper, we give a complete characterisation of the Lawvere-Tierney topologies on (semi-)simplicial sets, on bicolored graphs, and on fuzzy sets. We apply our results to establish that 'partially simple' simplicial sets and 'partially simple' graphs form quasitoposes.
Bibtex
@inproceedings{topos:lawvere:tierney:2023,
author = {Rosset, Alo{\"{\i}}s and Hansen, Helle Hvid and Endrullis, J{\"{o}}rg},
editor = {Hogeweg, Lotte and Jalali, Raheleh and Sedl{\'{a}}r, Igor and Schwarz, Lena},
title = {Characterisation of Lawvere-Tierney Topologies on Simplicial Sets,
Bicolored Graphs, and Fuzzy Sets},
booktitle = {Logic, Language, and Computation - 14th International Tbilisi Symposium,
TbiLLC 2023, Telavi, Georgia, September 18-22, 2023, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {15661},
pages = {258--284},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-032-14339-6\_14},
doi = {10.1007/978-3-032-14339-6\_14},
biburl = {https://dblp.org/rec/conf/tbillc/RossetHE23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org},
keywords = {category theory},
type = {conference}
}